Weapon-target assignment problem: exact and approximate solution algorithms
نویسندگان
چکیده
The Weapon-Target Assignment (WTA) problem aims to assign a set of weapons number assets (targets), such that the expected value survived targets is minimized. WTA nonlinear combinatorial optimization known be NP-hard. This paper applies several existing techniques linearize problem. One linearization technique (Camm et al. in Oper Res 50(6):946–955, 2002) approximates terms via convex piecewise linear functions and provides heuristic solutions Such approximation problems are, though, relatively easy solve from computational point view even for large-scale instances. Another approach proposed by O’Hanley (Eur J 230(1):63–75, 2013) linearizes exactly at expense incorporating significant additional variables constraints, which makes many instances intractable. Motivated results experiments with these solution approaches, specialized new exact developed, called branch-and-adjust. involves compact under-approximation objective function solves exactly. algorithm builds on top any branch-and-cut or branch-and-bound can implemented using tools provided state-of-the-art mixed integer programming solvers. Numerical demonstrate capable handling very large scale up 1500 1000 targets, obtaining optimality gaps $$2.0\%$$ within 2 h runtime.
منابع مشابه
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...
متن کاملExact and Heuristic Methods for the Weapon Target Assignment Problem
The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...
متن کاملA Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem
We study the weapon-target assignment WTA problem which has wide applications in the area of defense-related operations research. This problem calls for finding a proper assignment of weapons to targets such that the total expected damaged value of the targets to be maximized. The WTA problem can be formulated as a nonlinear integer programming problem which is known to be NP-complete. There do...
متن کاملACGA Algorithm of Solving Weapon - Target Assignment Problem
Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integrat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2022
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-022-04525-6